# -*- coding: UTF-8 -*-
from typing import List

from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def lastStoneWeightII(self, stones: List[int]) -> int:
        m = len(stones)
        total = sum(stones)
        target = total // 2
        max_item = max(stones)

        if m < 2:
            return stones[-1]

        if max_item > target:
            return max_item - target

        dp = [[0] * (target + 1) for _ in range(m)]

        for j in range(target, -1, -1):
            if j >= stones[0]:
                dp[0][j] = stones[0]

        for i in range(1, m):
            for j in range(target, -1, -1):
                if j >= stones[i]:
                    value = dp[i - 1][j - stones[i]] + stones[i]
                    dp[i][j] = max(dp[i - 1][j], value)
                else:
                    dp[i][j] = dp[i - 1][j]

        ans = total - 2 * dp[m - 1][target]
        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 1, 4, 2, 2], 0),
        ([2, 7, 4, 1, 8, 1], 1),
        ([31, 26, 33, 21, 40], 5),
        ([1, 2], 1)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.lastStoneWeightII(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)
